Composite rational functions expressible with few terms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressible Semantics for Expressible Counterfactuals

Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources). I define a natural, restricted version of premise semantics, expressible premise semantics, which is based on ordering sources containing onl...

متن کامل

When epsilon-expansion of hypergeometric functions is expressible in terms of multiple polylogarithms: the two-variables examples

∗Speaker. †This work was supported in part by the German Federal Ministry for Education and Research BMBF through Grant No. 05 HT6GUA, by the German Research Foundation DFG through the Collaborative Research Centre No. 676 Particles, Strings and the Early Universe—The Structure of Matter and Space-Time, and by the Helmholtz Association HGF through the Helmholtz Alliance Ha 101 Physics at the Te...

متن کامل

Counting with rational generating functions

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...

متن کامل

Rational Functions with Linear Relations

We find all polynomials f, g, h over a field K such that g and h are linear and f(g(x)) = h(f(x)). We also solve the same problem for rational functions f, g, h, in case the field K is algebraically closed.

متن کامل

Implementing Few-Body Algorithmic Regularization with Post-Newtonian Terms

We discuss the implementation of a new regular algorithm for simulation of the gravitational few-body problem. The algorithm uses components from earlier methods, including the chain structure, the logarithmic Hamiltonian, and the time-transformed leapfrog. The code can be used for the normal N -body problem, as well as for problems with softened potentials and/or with velocity-dependent extern...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the European Mathematical Society

سال: 2012

ISSN: 1435-9855

DOI: 10.4171/jems/299